A Congruence for Gamma Programs
نویسندگان
چکیده
This paper deenes a congruence relation on Gamma programs. Based on this congruence relation, laws for transforming programs are derived. We deene an axiomatic semantics for Gamma based on Brookes' transition assertions. The deenition of the congruence is in terms of provable satissability of such assertions. We consider the relationship between our congruence and other orderings that have been proposed in the literature.
منابع مشابه
Introduction of a Reliable Software for the Calculation of the Gamma Index
Introduction: The gamma index is a known parameter for radiotherapy dose verification. Many free and commercial programs have been written for the calculation of this index. However, the verification of the results has been overlooked in many of the programs. The present study tested the validity of three gamma index calculator programs. Material and ...
متن کاملThe Personality Congruence of Iranian Veterinary Students with Their Field of Study
Introduction: Evidence shows problems like feelings of dislike for the profession, job inconsistency, and low rate of career success have increased among the Iranian vets in the recent years. We have studied the correlation between personality congruence of Iranian veterinary students with their field of study to find the cause of the mentioned problems. Methods: In this survey study, we admin...
متن کاملDetecting Program Components With Equivalent Behaviors
The execution behavior of a program component is defined as the sequence of values produced at the component during program execution. This paper presents an efficient algorithm for detecting program components − in one or more programs − that exhibit identical execution behaviors. The algorithm operates on a new graph representation for programs that combines features of static-single-assignme...
متن کاملPeriodic Single-Pass Instruction Sequences
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs. The resulting mathematical structure is a semigroup. We show that a kernel of this syntax can replace PGA as a carrier for program algebra by providing axioms for defining single-pass congruence an...
متن کاملA Refinement Theory for Concurrent Object Oriented Languages
A notion of refinement for concurrent object-oriented programs was originally presented in [3]. ln th.is article we prove that the refinement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and nondeterministic internal choice. We also establish a weaker compositio...
متن کامل